Deterministic stack automata and the quotient operator
نویسندگان
چکیده
منابع مشابه
DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملInput-Driven Stack Automata
We introduce and investigate input-driven stack automata, which are a generalization of input-driven pushdown automata that recently became popular under the name visibly pushdown automata. Basically, the idea is that the input letters uniquely determine the operations on the pushdown store. This can nicely be generalized to stack automata by further types of input letters which are responsible...
متن کاملA Quotient Stack Related to the Weyl Algebra
Let A denote the ring of differential operators on the affine line with its two usual generators t and d dt given degrees +1 and −1 respectively. Let X be the stack having coarse moduli space the affine line Spec k[z] and isotropy groups Z/2 at each integer point. Then the category of graded A-modules is equivalent to the category of quasicoherent sheaves on X .
متن کاملAlternating and Empty Alternating Auxiliary Stack Automata
We consider variants of alternating auxiliary stack automata and characterize their computational power when the number of alternations is bounded by a constant or unlimited. In this way we get new characterizations of NP, the polynomial hierarchy, PSpace, and bounded query classes like co-DP=NL〈NP[1]〉 and 2P=P , in a uniform framework. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملFailure Deterministic Finite Automata
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1968
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(68)80003-0